An Optimal Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs
نویسندگان
چکیده
Suppose that T is a spanning tree of a graph G. T is called a locally connected spanning tree of G if for every vertex of T , the set of all its neighbors in T induces a connected subgraph of G. In this paper, given an intersection model of a circulararc graph, an O(n)-time algorithm is proposed that can determine whether the circular-arc graph contains a locally connected spanning tree or not, and produce one if it exists.
منابع مشابه
Locally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ∈ V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.
متن کاملParallel Algorithms for Connected Domination Problem on Interval and Circular-arc Graphs
A connected domination set of a graph is a set of vertices such that every vertex not in is adjacent to and the induced subgraph of is connected. The minimum connected domination set of a graph is the connected domination set with the minimum number of vertices. In this paper, we propose parallel algorithms for finding the minimum connected domination set of interval graphs and circular-arc gra...
متن کاملDegree-constrained spanning trees
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...
متن کاملAn Algorithm for Finding All the Spanning Trees in Undirected Graphs
In this paper, we propose an algorithm for nding all the spanning trees in undirected graphs. The algorithm requires O(n +m + n) time and O(n +m) space, where the given graph has n vertices, m edges and spanning trees. For outputting all the spanning trees explicitly, this algorithm is optimal.
متن کاملFinding Four Independent Trees
Motivated by a multi-tree approach to the design of reliable communication protocols, Itai and Rodeh gave a linear time algorithm for finding two independent spanning trees in a 2-connected graph. Cheriyan and Maheshwari gave an O(|V |) algorithm for finding three independent spanning trees in a 3-connected graph. In this paper we present an O(|V |) algorithm for finding four independent spanni...
متن کامل